New Constructions of Permutation Arrays
نویسندگان
چکیده
A permutation array(permutation code, PA) of length n and distance d, denoted by (n, d) PA, is a set of permutations C from some fixed set of n elements such that the Hamming distance between distinct members x,y ∈ C is at least d. In this correspondence, we present two constructions of PA from fractional polynomials over finite field, and a construction of (n, d) PA from permutation group with degree n and minimal degree d. All these new constructions produces some new lower bounds for PA.
منابع مشابه
New Constructions of Distance-Increasing Mappings and Permutation Arrays
Permutation arrays (PAs, or permutation codes) are useful in communication over power lines. Distance-increasing mappings (DIMs) from the set of binary vectors of a fixed length to the set of permutations of the same length that strictly increase Hamming distances (except when that is obviously not possible) are useful to construct permutation arrays. In this paper, we first give a new recursiv...
متن کاملConstructions for Permutation Codes in Powerline Communications
A permutation array (or code) of length n and distance d is a set G of permutations from some fixed set of n symbols such that the Hamming distance between each distinct x; y [G is at least d. One motivation for coding with permutations is powerline communication. After summarizing known results, it is shown here that certain families of polynomials over finite fields give rise to permutation a...
متن کاملFrequency Permutation Arrays
Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n = mλ and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency λ, such that the Hamming distance between any distinct x, y ∈ T is at least d. Such arrays have potential applications in p...
متن کاملA New Construction of Permutation Arrays
and a positive integer m. The resulted array has ( |PA(p, k)| · p(m−1)(p−k) )m rows. Compared to the other constructions, the new construction gives a permutation array of far bigger size with a large minimum distance, for example, when k ≥ 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA ( pm, pm−1k ) for a given index i very simply. key words: permutat...
متن کاملConstructions of Permutation Arrays for Certain Scheduling Cost Measures
Constructions of permutation arrays are presented that are optimal or nearlyoptimal with respect to two cost measures: the so-called longest-jump measure and the longest-monotone-greedy-subsequence measure. These measures arise in the context of scheduling problems in asynchronous, shared memory, multiprocessor machines. ∗Computer Science Department, Technion — Israel Institute of Technology, H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0801.3987 شماره
صفحات -
تاریخ انتشار 2008